Randomly generated polytopes for testing mathematical programming algorithms
نویسندگان
چکیده
منابع مشابه
Randomly generated polytopes for testing mathematical programming algorithms
Randomly generated polytopes are used frequently to test and compare algorithms for a variety of mathematical programming problems. These polytopes are constructed by generating linear inequality constraints with coefficients drawn independently from a distribution such as the uniform or the normal. It is noted that this class of 'random' polytopes has a special property: the angles between the...
متن کاملTesting MCMC algorithms with randomly generated Bayesian networks
In this work we show how to generate random Bayesian networks and how to test inference algorithms using these samples. First, we present a new method to generate random networks through Markov chains. We then use random networks to investigate the performance of quasi-random numbers in Gibbs sampling algorithms for inference. We present experimental results and describe code that implements ou...
متن کاملTesting Static Analyzers with Randomly Generated Programs
Static analyzers should be correct. We used the random Cprogram generator Csmith, initially intended to test C compilers, to test parts of the Frama-C static analysis platform. Although Frama-C was already relatively mature at that point, fifty bugs were found and fixed during the process, in the front-end (AST elaboration and typechecking) and in the value analysis, constant propagation and sl...
متن کاملMathematical programming algorithms for spatial cloaking
We consider a combinatorial optimization problem for spatial information cloaking. The problem requires to compute one or several disjoint arborescences on a graph from a predetermined root or subset of candidate roots, so that the number of vertices in the arborescences is minimized but a given threshold on the overall weight associated with the vertices in each arborescence is reached. For a ...
متن کاملMathematical Programming Algorithms for Reliable Routing and Robust Evacuation Problems
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 Chapter
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1983
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf02592053